Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér-Rao Bound
نویسندگان
چکیده
Reconstructing a signal from squared linear (rankone quadratic) measurements is a challenging problem with important applications in optics and imaging, where it is known as phase retrieval. This paper proposes two new phase retrieval algorithms based on non-convex quadratically constrained quadratic programming (QCQP) formulations, and a recently proposed approximation technique dubbed feasible point pursuit (FPP). The first is designed for uniformly distributed bounded measurement errors, such as those arising from high-rate quantization (BFPP). The second is designed for Gaussian measurement errors, using a least squares criterion (LS-FPP). Their performance is measured against state-of-the-art algorithms and the CramérRao bound (CRB), which is also derived here. Simulations show that LS-FPP outperforms the state-of-art and operates close to the CRB. Compact CRB expressions, properties, and insights are obtained by explicitly computing the CRB in various special cases – including when the signal of interest admits a sparse parametrization, using harmonic retrieval as an example.
منابع مشابه
Cramér-Rao-Induced Bound for Blind Separation of Stationary Parametric Gaussian Sources
The performance of blind source separation algorithms is commonly measured by the output interference to signal ratio (ISR). In this paper we derive an asymptotic bound on the attainable ISR for the case of Gaussian parametric (autoregressive (AR), moving-average (MA) or ARMA) processes. Our bound is induced by the Cramér-Rao bound on estimation of the mixing matrix. We point out the relation t...
متن کاملBayesian estimation in homodyne interferometry
We address phase-shift estimation by means of squeezed vacuum probe and homodyne detection. We analyse Bayesian estimator, which is known to asymptotically saturate the classical Cramér–Rao bound to the variance, and discuss convergence looking at the a posteriori distribution as the number of measurements increases. We also suggest two feasible adaptive methods, acting on the squeezing paramet...
متن کاملThe Marginal Bayesian Cramér-Rao Bound for Jump Markov Systems
In this letter, numerical algorithms for computing the marginal version of the Bayesian Cramér-Rao bound (M-BCRB) for jump Markov nonlinear systems and jump Markov linear Gaussian systems are proposed. Benchmark examples for both systems illustrate that the M-BCRB is tighter than three other recently proposed BCRBs. Index Terms Jump Markov nonlinear systems, Bayesian Cramér-Rao bound, particle ...
متن کاملAn Hybrid Cramér-Rao Bound in Closed Form for Direction-of-Arrival Estimation by an "Acoustic Vector Sensor" With Gain-Phase Uncertainties
An “acoustic vector sensor” (also known as a “vector hydrophone” in underwater or sea-surface applications) is composed of three orthogonally oriented uni-axial particle-velocity sensors, plus a “pressure-sensor” (i.e., a microphone or a hydrophone)—all collocated in a point-like spatial geometry. (This collocated setup is versatile for direction finding, because its azimuth-elevation spatial r...
متن کاملZiv-Zakai error bounds for quantum parameter estimation.
I propose quantum versions of the Ziv-Zakai bounds as alternatives to the widely used quantum Cramér-Rao bounds for quantum parameter estimation. From a simple form of the proposed bounds, I derive both a Heisenberg error limit that scales with the average energy and a limit similar to the quantum Cramér-Rao bound that scales with the energy variance. These results are further illustrated by ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 64 شماره
صفحات -
تاریخ انتشار 2016